The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
نویسندگان
چکیده
Many combinatorial problems are NP-complete for general graphs, but are not NP-complete for partial k-trees (graphs of treewidth bounded by a constant k) and can be efficiently solved in polynomial time or mostly in linear time for partial k-trees. On the other hand, very few problems are known to be NP-complete for partial k-trees with bounded k. These include the subgraph isomorphism problem and the bandwidth problem. However, all these problems are NP-complete even for ordinary trees or forests. In this paper we show that the edge-disjoint paths problem is NP-complete for partial k-trees with some bounded k, say k = 3, although the problem is trivially solvable for trees.
منابع مشابه
The edge-disjoint paths problem is NP-complete for series-parallel graphs
Many combinatorial problems are NP-complete for general graphs. However, when restricted to series–parallel graphs or partial k-trees, many of these problems can be solved in polynomial time, mostly in linear time. On the other hand, very few problems are known to be NP-complete for series–parallel graphs or partial k-trees. These include the subgraph isomorphism problem and the bandwidth probl...
متن کاملLength 3 Edge-Disjoint Paths and Partial Orientation
In 2003, it was claimed that the following problem was solvable in polynomial time: do there exist k edge-disjoint paths of length exactly 3 between vertices s and t in a given graph? The proof was flawed, and we show that this problem is NP-hard even if we disallow multiple edges. We use a reduction from Partial Orientation, a problem recently shown by Pálvölgyi to be NP-hard. In [2], Bley dis...
متن کاملOn Approximate Min-Max Theorems for Graph Connectivity Problems by Lap
On Approximate Min-Max Theorems for Graph Connectivity Problems Lap Chi Lau Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2006 Given an undirected graph G and a subset of vertices S ⊆ V (G), we call the vertices in S the terminal vertices and the vertices in V (G) − S the Steiner vertices. In this thesis, we study two problems whose goals are to achieve high...
متن کاملOn the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
GivenagraphG = (V,E) andk source-sinkpairs{(s1, t1), . . . , (sk, tk)} with each si, ti ∈ V , the Min-Sum Disjoint Paths problem asks k disjoint paths to connect all the source-sink pairs with minimized total length, while the Min-Max Disjoint Paths problem asks also k disjoint paths to connect all source-sink pairs but with minimized length of the longest path. In this paper we show that the w...
متن کاملOn the tractability of some natural packing, covering and partitioning problems
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuits, forests, spanning trees, (not necessarily spanning) trees and cuts. Given an undirected graph G = (V, E) and two “object types” A and B chosen from the alternatives above, we consider the following questions. Packing problem: can we find an object of type A and one of type B in the edge set E ...
متن کامل